Introducing the Second International Competition on Computational Models of Argumentation

نویسندگان

  • Sarah Alice Gaggl
  • Thomas Linsbichler
  • Marco Maratea
  • Stefan Woltran
چکیده

Argumentation is a major topic in the study of artificial intelligence. In particular, the problem of solving certain reasoning tasks of Dung’s abstract argumentation frameworks is central to many advanced argumentation systems. The fact that problems to be solved are mostly intractable requires efficient algorithms and solvers, that are to be evaluated on meaningful benchmarks. In this report, we introduce the Second International Competition on Computational Models of Argumentation (ICCMA’17), which is jointly organized by TU Dresden (Germany), TU Wien (Austria), and the University of Genoa (Italy), in affiliation with the 2017 International Workshop on Theory and Applications of Formal Argumentation (TAFA’17).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introducing EqArgSolver: An argumentation solver using equational semantics

In this paper we introduce EqArgSolver, an argumentation solver using equational semantics. EqArgSolver is based on the prototype GRIS submitted to the first International Competition on Computational Models of Argumentation, but provides two major advancements over GRIS. Firstly, it uses the much more e cient discrete version of the Gabbay-Rodrigues Iteration Schema [7], and secondly, it requi...

متن کامل

System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15)

LabSAT is a solver for computing several reasoning tasks in abstract argumentation frameworks. It enumerates extensions of the complete, preferred, stable and grounded semantics. Further, LabSAT solves the problem of deciding credulously and skeptically. The solver utilizes the labelling approach by Caminada and translates it into a boolean satisfiability problem (SAT).

متن کامل

Foundations of Implementations for Formal Argumentation

We survey the current state of the art of general techniques, as well as specific software systems for solving tasks in abstract argumentation frameworks, structured argumentation frameworks, and approaches for visualizing and analysing argumentation. Furthermore, we discuss challenges and promising techniques such as parallel processing and approximation approaches. Finally, we address the iss...

متن کامل

1 Foundations of Implementations for For - mal Argumentation Federico Cerutti

We survey the current state of the art of general techniques, as well as specific software systems for solving tasks in abstract argumentation frameworks, structured argumentation frameworks, and approaches for visualizing and analysing argumentation. Furthermore, we discuss challenges and promising techniques such as parallel processing and approximation approaches. Finally, we address the iss...

متن کامل

Towards Advanced Systems for Abstract Argumentation

Within the last years, and in particular due to the first edition of the International Competition on Computational Models of Argumentation (ICCMA) in 2015, the field of formal argumentation has seen an increasing number of systems for Dung’s abstract argumentation framework. However, the majority of the current approaches rely on reductions to other solving paradigms like SAT-solving and Answe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016